Highly symmetric generalized circulant permutation matrices
نویسندگان
چکیده
منابع مشابه
Lightweight MDS Generalized Circulant Matrices
In this article, we analyze the circulant structure of generalized circulant matrices to reduce the search space for finding lightweight MDS matrices. We first show that the implementation of circulant matrices can be serialized and can achieve similar area requirement and clock cycle performance as a serial-based implementation. By proving many new properties and equivalence classes for circul...
متن کاملSymmetric Circulant Matrices and Publickey Cryptography
An important aspect of cryptography with matrices is that given N ×N matrix P over a field F find a class of matrices G over F such that the associated doubly circulant matrix Gc is singular in order that the equation AGB = P in circulant matrices A,B has infinitely many solutions. The aim of this note is to present such a class of matrices G. We also present a direct method of finding the inve...
متن کاملLightweight MDS Generalized Circulant Matrices (Full Version)
In this article, we analyze the circulant structure of generalized circulant matrices to reduce the search space for finding lightweight MDS matrices. We first show that the implementation of circulant matrices can be serialized and can achieve similar area requirement and clock cycle performance as a serial-based implementation. By proving many new properties and equivalence classes for circul...
متن کاملThe Limiting Spectral Measure for the Ensemble of Generalized Real Symmetric Block m-Circulant Matrices
Given an ensemble of N × N random matrices with independent entries chosen from a nice probability distribution, a natural question is whether the empirical spectral measures of typical matrices converge to some limiting measure as N → ∞. It has been shown that the limiting spectral distribution for the ensemble of real symmetric matrices is a semi-circle, and that the distribution for real sym...
متن کاملGeneralized hyperbolic functions, circulant matrices and functional equations
There is a contrast between the two sets of functional equations f0(x + y) = f0(x)f0(y) + f1(x)f1(y), f1(x + y) = f1(x)f0(y) + f0(x)f1(y), and f0(x − y) = f0(x)f0(y)− f1(x)f1(y), f1(x − y) = f1(x)f0(y)− f0(x)f1(y) satisfied by the even and odd components of a solution of f(x + y) = f(x)f(y). J. Schwaiger and, later, W. Förg-Rob and J. Schwaiger considered the extension of these ideas to the cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2008
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.02.033